Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems

We consider a heterogeneous distributed service system consisting of n servers with unknown and possibly different processing rates. Jobs unit mean arrive as renewal process rate proportional to are immediately dispatched one several queues associated the servers. assume that dispatching decisions made by central dispatcher ability exchange messages endowed finite memory used store information from decision epoch next, about current state rates study fundamental resource requirements (memory bits message rate) in order for policy be always stable. First, we present is stable while using positive (but arbitrarily small) [Formula: see text] memory. Second, show within certain broad class policies, exchanges per time, memory, cannot